A New Construction of Permutation Arrays
نویسندگان
چکیده
and a positive integer m. The resulted array has ( |PA(p, k)| · p(m−1)(p−k) )m rows. Compared to the other constructions, the new construction gives a permutation array of far bigger size with a large minimum distance, for example, when k ≥ 2p/3. Moreover the proposed construction provides an algorithm to find the i-th row of PA ( pm, pm−1k ) for a given index i very simply. key words: permutation array, error correcting code
منابع مشابه
New Constructions of Distance-Increasing Mappings and Permutation Arrays
Permutation arrays (PAs, or permutation codes) are useful in communication over power lines. Distance-increasing mappings (DIMs) from the set of binary vectors of a fixed length to the set of permutations of the same length that strictly increase Hamming distances (except when that is obviously not possible) are useful to construct permutation arrays. In this paper, we first give a new recursiv...
متن کاملNew Constructions of Permutation Arrays
A permutation array(permutation code, PA) of length n and distance d, denoted by (n, d) PA, is a set of permutations C from some fixed set of n elements such that the Hamming distance between distinct members x,y ∈ C is at least d. In this correspondence, we present two constructions of PA from fractional polynomials over finite field, and a construction of (n, d) PA from permutation group with...
متن کاملConstructions for Permutation Codes in Powerline Communications
A permutation array (or code) of length n and distance d is a set G of permutations from some fixed set of n symbols such that the Hamming distance between each distinct x; y [G is at least d. One motivation for coding with permutations is powerline communication. After summarizing known results, it is shown here that certain families of polynomials over finite fields give rise to permutation a...
متن کاملPowerline communication and the 36 officers problem.
In this survey paper, we explore the interactions between mathematics and engineering inspired by the challenge of transmitting data along powerlines. In particular, we focus on how combinatorial objects called permutation arrays offer a way of encoding data which allows the noise problems experienced in powerline communications (PLCs) to be overcome. The first study of permutation codes was ca...
متن کاملDistance-preserving mappings from binary vectors to permutations
Mappings of the set of binary vectors of a fixed length to the set of permutations of the same length are useful for the construction of permutation codes. In this correspondence, several explicit constructions of such mappings preserving or increasing the Hamming distance are given. Some applications are given to illustrate the usefulness of the construction. In particular, a new lower bound o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 95-A شماره
صفحات -
تاریخ انتشار 2012